Quickly excluding a forest
نویسندگان
چکیده
منابع مشابه
Quickly Excluding K2, r from Planar Graphs
We prove that any planar graph that does not contain K2,r as a minor has treewidth ≤ r + 2.
متن کاملExcluding a Countable Clique
We extend the excluded Kn minor theorem of Robertson and Seymour to infinite graphs, and deduce a structural characterization of the infinite graphs that have no Kא0 minor. The latter is a refinement of an earlier characterization of Robertson, Seymour and the second author.
متن کاملExcluding a small minor
There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss the structure of graphs that do not contain a minor isomorphic to H.
متن کاملExcluding a group-labelled graph
This paper contains a first step towards extending the Graph Minors Project of Robertson and Seymour to group-labelled graphs. For a finite abelian group Γ and Γ-labelled graph G, we describe the class of Γ-labelled graphs that do not contain a minor isomorphic to G.
متن کاملMaking Good Decisions Quickly
Several disciplines, including artificial intelligence, operations research and many others, study how to make good decisions. In this overview article, we argue that the key to making progress in our research area is to combine their ideas, which often requires serious technical advances to reconcile their different assumptions and methods in a way that results in synergy among them. To illust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1991
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90068-u